Geometric Problems and Algorithms in Computer-Aided Molecular Design

نویسنده

  • Matthias Rarey
چکیده

Computer-Aided Molecular Design describes a research area covering all kinds of computer applications in the design of molecules having desired properties. It is widely applied for the design of bioactive molecules like pharmaceuticals or agricultural products. From the computer scientists perspective, computer-aided molecular design contains a large variety of computational problems, often geometric and/or combinatorial in nature. In the introductory part of this talk, a short overview of these problems is given. The main focus in this talk will be on protein-ligand docking. The aim of a docking calculation is to predict, whether two molecules bind to each other (i.e. form an energetically favorable complex). If they do so, one is interested in the geometry of the molecular complex and in the binding energy. The most prominent variant is protein-ligand docking. Here the first molecule is a protein while the second molecule is a small compound. Since most drug targets are proteins and most drugs are small compounds, software for protein-ligand docking is extensively used in pharmaceutical research. Since 1993, we are developing the software package FlexX which belongs to the most widely used codes for protein-ligand docking. An outline of the underlying models, the applied algorithms as well as some examples will be presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Surface fitting and registration of point clouds using approximations of the unsigned distance function

Many problems in computer aided geometric design and geometry processing are stated as least– squares optimizations. Least–squares problems are well studied and widely used but exhibit immanent drawbacks such as high sensitivity to outliers. For this reason, we consider techniques for the registration of point clouds and surface fitting to point sets based on the l1-norm. We develop algorithms ...

متن کامل

Computational Topology for Geometric and Molecular Approximations

The goal of this research will be to provide sufficient conditions and tractable algorithms that guarantee the topological embedding of geometric approximations commonly used by modern geometric design systems. Particular focus is on the use of ambient isotopy as the measure of topological equivalence, which is stricter than the more traditional use of homeomorphism. Such topological guarantees...

متن کامل

Computer algebra and geometry – some interactions

Algebraic curves and surfaces have been studied intensively in algebraic geometry for centuries. Thus, there exists a huge amount of theoretical knowledge about these geometric objects. Recently, algebraic curves and surfaces play an important and ever increasing rôle in computer aided geometric design, computer vision, computer aided manufacturing, coding theory, and cryptography, just to name...

متن کامل

Computer Aided Molecular Modeling Of Membrane Metalloprotease

Molecular modeling is a set of computational techniques for construction of 3D structure of a protein especially membrane bound proteins whose structures can not be elucidated using experimental techniques. These techniques has been applied in the study of membrane metalloproteases for comparing wild and mutated enzymes, docking inhibitors in the catalytic site and examination of binding pocket...

متن کامل

Computing general geometric structures on surfaces using Ricci flow

Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic framework, geometric structure, to conquer this problem. In order to discover the intrinsic geometric structures of general surfaces, we developed a theoretic rigorous and practical efficient method, Discrete Variational R...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002